Penetration trajectory optimization for the hypersonic gliding vehicle encountering two interceptors

The penetration trajectory optimization problem for the hypersonic gliding vehicle (HGV) encountering two interceptors is investigated. HGV considering terminal target area formulated as a nonconvex optimal control problem. transformed into second-order cone programming (SOCP) problem, which can be solved by state-of-the-art interior-point methods. In addition, strategy that only requires initial line-of-sight angle information of proposed. convergent obtained proposed method allows to evade and reach successfully. Furthermore, successive SOCP with variable trust region presented, critical balancing trade-off between time consumption optimality. Finally, effectiveness performance are verified numerical simulations.